Bounding Algorithms for Design Space Exploration

A Power Aware Cache and Register File Design Space Exploration

SYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES

In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...

Evaluation of Design Space Exploration Strategies

The design space exploration (DSE) subsystem of a design automation tool is responsible for early identification of interesting zones of the design space. Evaluation of the exploration strategy used in a tool is extremely difficult because there is not enough information about either the design space or the actual cost function. This paper describes a software environment for quantitative evalu...

Chaudhuri and Walker : Computing Lower Bounds On

1 Computing Lower Bounds on Functional Units Before Scheduling1 Samit Chaudhuri2, Robert A. Walker3 Abstract|This paper presents a new polynomial-time algorithm for computing lower bounds on the number of functional units (FUs) of each type required to schedule a data ow graph in a speci ed number of control steps. A formal approach is presented that is guaranteed to nd the tightest possible bo...

Walker : Lower Bounds on Functional Units

|This paper presents a new polynomial-time algorithm for computing lower bounds on the number of functional units (FUs) of each type required to schedule a data ow graph in a speci ed number of control steps. A formal approach is presented that is guaranteed to nd the tightest possible bounds that can be found by relaxing either the precedence constraints or integrality constraints on the sched...